In search of a compromised solution to the problem arising from patenting biomedical research tools.
نویسنده
چکیده
منابع مشابه
A Tabu Search Based Solution Approach to the Competitive Multiple Allocation Hub Location Problem
The hub location problems (HLP) constitute an important class of facility location problems that have been addressed by numerous operations researchers in recent years. HLP is a strategic problem frequently encountered in designing logistics and transportation networks. Here, we address the competitive multiple allocation HLP in a duopoly market. It is assumed that an incumbent firm (the leader...
متن کاملA heuristic approach for multi-stage sequence-dependent group scheduling problems
We present several heuristic algorithms based on tabu search for solving the multi-stage sequence-dependent group scheduling (SDGS) problem by considering minimization of makespan as the criterion. As the problem is recognized to be strongly NP-hard, several meta (tabu) search-based solution algorithms are developed to efficiently solve industry-size problem instances. Also, two different initi...
متن کاملSolution of strongly nonlinear oscillator problem arising in Plasma Physics with Newton Harmonic Balance Method
In this paper, Newton Harmonic Balance Method (NHBM) is applied to obtain the analytical solution for an electron beam injected into a plasma tube where the magnetic field is cylindrical and increases towards the axis in inverse proportion to the radius. Periodic solution is analytically verified and consequently the relation between the Natural Frequency and the amplitude is obtained in an ana...
متن کاملA Novel Adapted Multi-objective Meta-heuristic Algorithm for a Flexible Bi-objective Scheduling Problem Based on Physics Theory
We relax some assumptions of the traditional scheduling problem and suggest an adapted meta-heuristic algorithm to optimize efficient utilization of resources and quick response to demands simultaneously. We intend to bridge the existing gap between theory and real industrial scheduling assumptions (e.g., hot metal rolling industry, chemical and pharmaceutical industries). We adapt and evalua...
متن کاملAn Improved Tabu Search Algorithm for Job Shop Scheduling Problem Trough Hybrid Solution Representations
Job shop scheduling problem (JSP) is an attractive field for researchers and production managers since it is a famous problem in many industries and a complex problem for researchers. Due to NP-hardness property of this problem, many meta-heuristics are developed to solve it. Solution representation (solution seed) is an important element for any meta-heuristic algorithm. Therefore, many resear...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Santa Clara computer and high-technology law journal
دوره 20 2 شماره
صفحات -
تاریخ انتشار 2004